¶¶Òõ¶ÌÊÓƵ

Joshua A. Grochow is an assistant professor of computer science and mathematics at ¶¶Òõ¶ÌÊÓƵ Boulder. His work focuses on two deeply - but not obviously - related themes:

• understanding the ultimate limits of computation (computational complexity), especially in their two-way relationship with algebraic geometry, representation theory, and group theory, and
• developing the theory of complex systems and complex networks.

Prior to his current position, he wasÌýan Omidyar Fellow at the Santa Fe Institute andÌýa postdoc in the CS Theory group at the University ofÌýToronto. He got his PhDÌýin CS from the University of Chicago, an MEngÌýin CS focusing on computational biology from the MassachusettsÌýInstitute of Technology, and undergraduate degrees in CS and mathematics from MIT.

Select Publications

• ÌýWith T. Pitassi. Journal of the ACM, 65(6), Article No. 37, November 2018. Preliminary version in FOCS '14.
• . Computational Complexity, Special Issue, 24(2):393-475, 2015. Preliminary version in CCC '14.
• ÌýWith Y. Qiao.ÌýSIAM J. Comput., 52(2):568-617, 2023. Preliminary version appeared at ITCS '21, preprint arXiv '19.
• ÌýWith J. Blasiak, T. Church, H. Cohn, E. Naslund, W. Sawin, and C. Umans. Discrete Analysis 2017:3.
• ÌýWith M. Kumar, M. Saks, and S. Saraf.ÌýarXiv:1701.01717 [cs.CC, math.AG], 2017.
• ÌýWith C. Moore.ÌýarXiv:1708.09398 [cs.DS, cs.CC, cs.SC, math.RT], 2017.
• ÌýTheory of Computing 13:18, 2017.
• ÌýWith N. A. Collins, M. Levet, A. Weiß. arXiv:2402.00133 [cs.CC, cs.DS, math.CO, math.GR], 2024.

Video: Grochow's talksÌýstarts at 36:20.

[video:https://www.youtube.com/watch?v=aXKDLO4_TM0&start=2180s]